On the expressive power of semijoin queries

نویسندگان

  • Dirk Leinders
  • Jerzy Tyszkiewicz
  • Jan Van den Bussche
چکیده

The semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We provide an Ehrenfeucht-Fraissé game, characterizing the discerning power of the semijoin algebra. This game gives a method for showing that queries are not expressible in the semijoin algebra.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repetitions and permutations of columns in the semijoin algebra

Codd defined the relational algebra [3, 4] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, using the join operation, one can rewrite any relational algebra expression into a...

متن کامل

Investigating the 2-way Semijoin for Distributed Query Optimization

With increased globalization, most databases are now highly distributed. Thus, there is a need to reduce the cost of queries that require data from several locations. In the literature, the semijoin is the most commonly used operation for the reduction phase of any distributed query optimization strategy. In [7] an improvement, called the 2-way semijoin, is proposed. The authors conclude that t...

متن کامل

The semijoin algebra and the guarded fragment

The semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We discuss some interesting connections between the semijoin algebra and the guarded fragment of first-order logic. We also provide an Ehrenfeucht-Fräıssé game, characterizing the discerning power of the semijoin algebra. This game gives a method for showing that certa...

متن کامل

Optimizing Entity Join Queries by Extended Semijoins in a Wide Area Multidatabase Environment

In this paper we consider processing entity join queries in a wide area multidatabase environmen t where the query processing cost is dominated by the cost of data transmission An entity join oper ation integrates tuples representing the same en tities from di erent relations in which inconsistent data may exist The semijoin technique has been successfully used in a distributed database system ...

متن کامل

An Intelligent Search Method for Query Optimization by Semijoins

Query optimization strategies based on the reduction of the referenced relations by means of semijoins have received considerable attention. The limitations of such strategies have to do with computational e5ciency (very large search space of semijoin reduction sequences), optimality of the solution (when heuristics are used), and generality of the class of queries allowed (e.g., simple queries...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 91  شماره 

صفحات  -

تاریخ انتشار 2004